
/*
Description:
Given a non-empty array of integers, every element appears twice except for one. Find that single one.

Note:

Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

Example 1:

Input: [2,2,1]
Output: 1

Example 2:

Input: [4,1,2,1,2]
Output: 4
*/

#include <iostream>
#include <string>
#include <vector>
using namespace std;

class Solution {
public:
	int singleNumber(vector<int>& nums) {
		
		return 1;
	}
};

int _singleNumber()
{
	vector<int> nums{ 4,1,2,1,2 };// { 2, 2, 1 };

	Solution solu;
	int num;

	num = solu.singleNumber(nums);

	cout << "nums: " << endl;
	for (auto n : nums) cout << n << " ";
	cout << endl;
	cout << "num: " << num << endl;
	return 0;
}